Facet - de ning inequalities for the cutting
نویسنده
چکیده
In this paper the polyhedron of the cutting stock problem is investigated with respect to facet-de ning inequalities. For some classes of valid inequalities this property is proved.
منابع مشابه
On a Generalization of the Master Cyclic Group Polyhedron
Sanjeeb Dash IBM Research Ricardo Fukasawa Georgia Inst. Tech. Oktay G unl uk IBM Research March 6, 2008 Abstract We study the Master Equality Polyhedron (MEP) which generalizes the Master Cyclic Group Polyhedron and the Master Knapsack Polyhedron. We present an explicit characterization of the polar of the nontrivial facet-de ning inequalities for MEP. This result generalizes similar results...
متن کاملTwo-Layer Planarization in Graph Drawing
We study the two-layer planarization problems that have applications in Automatic Graph Drawing. We are searching for a two-layer planar subgraph of maximumweight in a given two-layer graph. Depending on the number of layers in which the vertices can be permuted freely, that is, zero, one or two, di erent versions of the problems arise. The latter problem was already investigated in [11] using ...
متن کاملOn Disjunctive Cuts for Combinatorial Optimization
In the successful branch-and-cut approach to combinatorial optimization, linear inequalities are used as cutting planes within a branch-and-bound framework. Although researchers often prefer to use facet-inducing inequalities as cutting planes, good computational results have recently been obtained using disjunctive cuts, which are not guaranteed to be facet-inducing in general. A partial expla...
متن کاملNotes on polyhedra associated with hop-constrained paths
We study the dominant of the convex hull of st-paths with at most k edges in a graph. A complete linear description is obtained for k ≤ 3 and a class of facet de ning inequalities for k ≥ 4 is given.
متن کاملBox-inequalities for quadratic assignment polytopes
Linear Programming based lower bounds have been considered both for the general as well as for the symmetric quadratic assignment problem several times in the recent years. Their quality has turned out to be quite good in practice. Investigations of the polytopes underlying the corresponding integer linear programming formulations (the non-symmetric and the symmetric quadratic assignment polyto...
متن کامل